By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 31, Issue 3, pp. 665-988

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Algorithms for Capacitated Vehicle Routing

Moses Charikar, Samir Khuller, and Balaji Raghavachari

pp. 665-682

BibTeX  Abstract Full Text:  PDF

Optimal Sampling Strategies in Quicksort and Quickselect

Conrado Martínez and Salvador Roura

pp. 683-705

BibTeX  Abstract Full Text:  PDF

The Compactness of Interval Routing for Almost All Graphs

Cyril Gavoille and David Peleg

pp. 706-721

BibTeX  Abstract Full Text:  PDF

Topological Lower Bounds on Algebraic Random Access Machines

Amir M. Ben-Amram and Zvi Galil

pp. 722-761

BibTeX  Abstract Full Text:  PDF

Succinct Representation of Balanced Parentheses and Static Trees

J. Ian Munro and Venkatesh Raman

pp. 762-776

BibTeX  Abstract Full Text:  PDF

Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy

Denis Thérien and Thomas Wilke

pp. 777-798

BibTeX  Abstract Full Text:  PDF

Parallel Quantum Computation and Quantum Codes

Cristopher Moore and Martin Nilsson

pp. 799-815

BibTeX  Abstract Full Text:  PDF

Analysis of Timing-Based Mutual Exclusion with Random Times

Eli Gafni and Michael Mitzenmacher

pp. 816-837

BibTeX  Abstract Full Text:  PDF

A Characterization of Eventual Byzantine Agreement

Joseph Y. Halpern, Yoram Moses, and Orli Waarts

pp. 838-865

BibTeX  Abstract Full Text:  PDF

Evasiveness of Subgraph Containment and Related Properties

Amit Chakrabarti, Subhash Khot, and Yaoyun Shi

pp. 866-875

BibTeX  Abstract Full Text:  PDF

Compressibility and Resource Bounded Measure

Harry Buhrman and Luc Longpré

pp. 876-886

BibTeX  Abstract Full Text:  PDF

Resource-Bounded Kolmogorov Complexity Revisited

Harry Buhrman, Lance Fortnow, and Sophie Laplante

pp. 887-905

BibTeX  Abstract Full Text:  PDF

Separation of NP-Completeness Notions

A. Pavan and Alan L. Selman

pp. 906-918

BibTeX  Abstract Full Text:  PDF

Approximation Algorithms for Single-Source Unsplittable Flow

Stavros G. Kolliopoulos and Clifford Stein

pp. 919-946

BibTeX  Abstract Full Text:  PDF

Proof Techniques for Cryptographic Processes

Michele Boreale, Rocco De Nicola, and Rosario Pugliese

pp. 947-986

BibTeX  Abstract Full Text:  PDF

Corrigendum: Proximity in Arrangements of Algebraic Sets

J. H. Rieger

p. 987

BibTeX  Abstract Full Text:  PDF

Corrigendum: Edge-Disjoint Paths in Expander Graphs

Alan Frieze

p. 988

BibTeX  Abstract Full Text:  PDF